________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:31:29
Input Data from:  dataset129.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0653333333333333
Average f[i]   :4250
Average g[i,j] :2025
Total demand   :15510
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	0	1	-1	2	6500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 8
> Selected Move:	980	1	-1	5	12000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0    >new incumb.: 980


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 31
> Selected Move:	1510	1	-1	3	16500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0    >new incumb.: 1510


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 31
> Selected Move:	2030	1	-1	7	20500


> New Y[]: 
	
	 2  3  1  1  0  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 23
> Selected Move:	2310	3	2	4	19500


> New Y[]: 
	
	 2  3  0  1  1  1  0  1  0  0    >new incumb.: 2310


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 32
> Selected Move:	2430	3	7	8	20000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  1  0    >new incumb.: 2430


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 31
> Selected Move:	2340	3	5	7	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 32
> Selected Move:	2340	3	0	2	20000


> New Y[]: 
	
	 0  3  2  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 22
> Selected Move:	2220	3	4	5	20000


> New Y[]: 
	
	 0  3  2  1  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 25
> Selected Move:	2220	3	2	0	18500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 31
> Selected Move:	2340	3	5	9	19500


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 32
> Selected Move:	2080	3	9	2	19500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 23
> Selected Move:	2045	3	8	4	20500


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 19
> Selected Move:	1990	3	2	6	19500


> New Y[]: 
	
	 2  3  0  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 32
> Selected Move:	2140	3	7	8	20000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 32
> Selected Move:	2140	3	4	5	20000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 33
> Selected Move:	2030	3	6	9	21000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 25
> Selected Move:	2088	3	8	7	20500


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 31
> Selected Move:	2000	3	3	8	20500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 31
> Selected Move:	2220	3	9	4	19500


> New Y[]: 
	
	 2  3  0  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 33
> Selected Move:	1900	3	5	6	19500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 35
> Selected Move:	1900	3	4	3	18500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 31
> Selected Move:	1900	3	0	2	20000


> New Y[]: 
	
	 0  3  2  1  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 27
> Selected Move:	1925	3	6	9	21000


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 19
> Selected Move:	1848	4	2	9	21200


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,415

## ITERATION 25 #######################


> Neighbours evaluated; 15
> Selected Move:	2137	3	2	5	20200


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,42

## ITERATION 26 #######################


> Neighbours evaluated; 23
> Selected Move:	2178	3	9	4	20100


> New Y[]: 
	
	 0  3  0  1  2  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,425

## ITERATION 27 #######################


> Neighbours evaluated; 19
> Selected Move:	2008	4	4	5	20500


> New Y[]: 
	
	 0  3  0  1  1  2  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,43

## ITERATION 28 #######################


> Neighbours evaluated; 20
> Selected Move:	1934	3	5	9	20200


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  1  0  0 
 > pw :0,435

## ITERATION 29 #######################


> Neighbours evaluated; 20
> Selected Move:	1813	3	4	6	20200


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,44

## ITERATION 30 #######################


> Neighbours evaluated; 21
> Selected Move:	1856	3	9	4	20100


> New Y[]: 
	
	 0  3  0  1  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 31 #######################


> Neighbours evaluated; 20
> Selected Move:	1851	3	6	2	21100


> New Y[]: 
	
	 0  3  1  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 32 #######################


> Neighbours evaluated; 21
> Selected Move:	1600	2	8	-1	16600


> New Y[]: 
	
	 0  3  1  1  2  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 33 #######################


> Neighbours evaluated; 30
> Selected Move:	1690	3	7	5	18100


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 34 #######################


> Neighbours evaluated; 25
> Selected Move:	1740	3	4	9	18200


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,465

## ITERATION 35 #######################


> Neighbours evaluated; 19
> Selected Move:	1740	4	9	2	18000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,47

## ITERATION 36 #######################


> Neighbours evaluated; 21
> Selected Move:	1740	4	2	5	19500


> New Y[]: 
	
	 0  3  1  1  0  2  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,475

## ITERATION 37 #######################


> Neighbours evaluated; 22
> Selected Move:	1690	3	3	8	19500


> New Y[]: 
	
	 0  3  1  0  0  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,47

## ITERATION 38 #######################


> Neighbours evaluated; 24
> Selected Move:	1690	4	5	2	18000


> New Y[]: 
	
	 0  3  2  0  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,465

## ITERATION 39 #######################


> Neighbours evaluated; 24
> Selected Move:	1830	3	2	0	16500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 40 #######################


> Neighbours evaluated; 32
> Selected Move:	1740	3	8	3	16500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,455

## ITERATION 41 #######################


> Neighbours evaluated; 30
> Selected Move:	1690	3	9	4	15500


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 42 #######################


> Neighbours evaluated; 32
> Selected Move:	1810	1	-1	6	21000


> New Y[]: 
	
	 2  3  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 43 #######################


> Neighbours evaluated; 26
> Selected Move:	1870	3	4	7	19500


> New Y[]: 
	
	 2  3  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 44 #######################


> Neighbours evaluated; 30
> Selected Move:	1870	3	3	8	19500


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 45 #######################


> Neighbours evaluated; 32
> Selected Move:	1863	3	6	2	20500


> New Y[]: 
	
	 2  3  1  0  0  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,43

## ITERATION 46 #######################


> Neighbours evaluated; 27
> Selected Move:	1865	3	5	4	20500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,425

## ITERATION 47 #######################


> Neighbours evaluated; 21
> Selected Move:	1808	3	2	9	20500


> New Y[]: 
	
	 2  3  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 48 #######################


> Neighbours evaluated; 30
> Selected Move:	1840	3	8	3	20500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 49 #######################


> Neighbours evaluated; 29
> Selected Move:	1778	3	4	6	20500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 50 #######################


> Neighbours evaluated; 29
> Selected Move:	1775	3	9	2	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 51 #######################


> Neighbours evaluated; 26
> Selected Move:	1683	3	3	8	20500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 52 #######################


> Neighbours evaluated; 25
> Selected Move:	1680	3	2	9	20500


> New Y[]: 
	
	 2  3  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	1695	3	7	3	21000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 54 #######################


> Neighbours evaluated; 26
> Selected Move:	1630	3	9	2	21000


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 55 #######################


> Neighbours evaluated; 24
> Selected Move:	1625	3	6	4	21000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,46

## ITERATION 56 #######################


> Neighbours evaluated; 16
> Selected Move:	1620	3	4	5	21000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 57 #######################


> Neighbours evaluated; 13
> Selected Move:	1570	4	0	2	16000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 58 #######################


> Neighbours evaluated; 28
> Selected Move:	1725	1	-1	4	21500


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 59 #######################


> Neighbours evaluated; 14
> Selected Move:	1835	3	8	7	21000


> New Y[]: 
	
	 0  3  2  1  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 60 #######################


> Neighbours evaluated; 20
> Selected Move:	1740	3	2	8	21000


> New Y[]: 
	
	 0  3  0  1  1  1  0  1  2  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 61 #######################


> Neighbours evaluated; 24
> Selected Move:	1570	2	7	-1	17000


> New Y[]: 
	
	 0  3  0  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,49

## ITERATION 62 #######################


> Neighbours evaluated; 27
> Selected Move:	1690	3	8	2	17000


> New Y[]: 
	
	 0  3  2  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 63 #######################


> Neighbours evaluated; 23
> Selected Move:	1690	4	2	3	19500


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 64 #######################


> Neighbours evaluated; 22
> Selected Move:	1690	4	3	5	18500


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,505

## ITERATION 65 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	3	3	8	18500


> New Y[]: 
	
	 0  3  1  0  1  2  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,5

## ITERATION 66 #######################


> Neighbours evaluated; 25
> Selected Move:	1600	4	5	2	17000


> New Y[]: 
	
	 0  3  2  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,495

## ITERATION 67 #######################


> Neighbours evaluated; 26
> Selected Move:	1725	1	-1	7	21000


> New Y[]: 
	
	 0  3  2  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,49

## ITERATION 68 #######################


> Neighbours evaluated; 23
> Selected Move:	1510	2	5	-1	15500


> New Y[]: 
	
	 0  3  2  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,485

## ITERATION 69 #######################


> Neighbours evaluated; 29
> Selected Move:	1600	3	8	3	15500


> New Y[]: 
	
	 0  3  2  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 70 #######################


> Neighbours evaluated; 27
> Selected Move:	1600	4	2	3	18000


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,475

## ITERATION 71 #######################


> Neighbours evaluated; 25
> Selected Move:	1600	4	3	7	18700


> New Y[]: 
	
	 0  3  1  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,47

## ITERATION 72 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	3	4	9	19700


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,465

## ITERATION 73 #######################


> Neighbours evaluated; 22
> Selected Move:	1600	4	7	2	16500


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,46

## ITERATION 74 #######################


> Neighbours evaluated; 28
> Selected Move:	1600	4	2	3	19000


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,455

## ITERATION 75 #######################


> Neighbours evaluated; 21
> Selected Move:	1600	4	3	9	16700


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,45

## ITERATION 76 #######################


> Neighbours evaluated; 26
> Selected Move:	1570	3	7	8	17200


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,445

## ITERATION 77 #######################


> Neighbours evaluated; 26
> Selected Move:	1690	3	3	5	18200


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,44

## ITERATION 78 #######################


> Neighbours evaluated; 24
> Selected Move:	1690	4	9	8	20000


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,435

## ITERATION 79 #######################


> Neighbours evaluated; 26
> Selected Move:	1600	3	9	4	19000


> New Y[]: 
	
	 0  3  1  0  1  1  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 80 #######################


> Neighbours evaluated; 20
> Selected Move:	1600	4	8	4	18100


> New Y[]: 
	
	 0  3  1  0  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	1570	3	2	3	16100


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,42

## ITERATION 82 #######################


> Neighbours evaluated; 26
> Selected Move:	1570	4	4	3	17500


> New Y[]: 
	
	 0  3  0  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,415

## ITERATION 83 #######################


> Neighbours evaluated; 25
> Selected Move:	1600	3	3	0	15500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 84 #######################


> Neighbours evaluated; 31
> Selected Move:	1760	1	-1	6	21000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 85 #######################


> Neighbours evaluated; 29
> Selected Move:	1668	3	8	7	20500


> New Y[]: 
	
	 2  3  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 86 #######################


> Neighbours evaluated; 31
> Selected Move:	1680	3	6	2	21500


> New Y[]: 
	
	 2  3  1  0  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,395

## ITERATION 87 #######################


> Neighbours evaluated; 24
> Selected Move:	1550	3	7	3	22000


> New Y[]: 
	
	 2  3  1  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  1  1  0  0  0  0 
 > pw :0,39

## ITERATION 88 #######################


> Neighbours evaluated; 11
> Selected Move:	1510	4	1	2	17800


> New Y[]: 
	
	 2  0  3  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,385

## ITERATION 89 #######################


> Neighbours evaluated; 14
> Selected Move:	1587	1	-1	7	21800


> New Y[]: 
	
	 2  0  3  1  1  1  0  1  0  0 


> New S[]: 
	
	 0  0  0  1  1  1  0  0  0  0 
 > pw :0,39

## ITERATION 90 #######################


> Neighbours evaluated; 13
> Selected Move:	1768	3	4	8	20800


> New Y[]: 
	
	 2  0  3  1  0  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,395

## ITERATION 91 #######################


> Neighbours evaluated; 12
> Selected Move:	2102	3	2	9	20300


> New Y[]: 
	
	 2  0  0  1  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 92 #######################


> Neighbours evaluated; 28
> Selected Move:	1900	3	5	4	20300


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 93 #######################


> Neighbours evaluated; 27
> Selected Move:	2139	3	9	5	20200


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,41

## ITERATION 94 #######################


> Neighbours evaluated; 27
> Selected Move:	1810	4	5	4	21000


> New Y[]: 
	
	 2  0  0  1  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,415

## ITERATION 95 #######################


> Neighbours evaluated; 22
> Selected Move:	1704	3	4	6	20400


> New Y[]: 
	
	 2  0  0  1  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 96 #######################


> Neighbours evaluated; 23
> Selected Move:	1786	4	6	5	20200


> New Y[]: 
	
	 2  0  0  1  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 97 #######################


> Neighbours evaluated; 28
> Selected Move:	1773	3	5	9	20300


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,43

## ITERATION 98 #######################


> Neighbours evaluated; 24
> Selected Move:	1556	3	9	2	20800


> New Y[]: 
	
	 2  0  3  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 99 #######################


> Neighbours evaluated; 13
> Selected Move:	1732	3	6	4	20800


> New Y[]: 
	
	 2  0  3  1  1  0  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  1  0  0  1  0  0 
 > pw :0,44

## ITERATION 100 #######################


> Neighbours evaluated; 7
> Selected Move:	1724	3	2	6	20400


> New Y[]: 
	
	 2  0  0  1  1  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 101 #######################


> Neighbours evaluated; 24
> Selected Move:	1455	4	6	4	21000


> New Y[]: 
	
	 2  0  0  1  3  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,45

## ITERATION 102 #######################


> Neighbours evaluated; 23
> Selected Move:	1510	2	6	-1	15500


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,455

## ITERATION 103 #######################


> Neighbours evaluated; 25
> Selected Move:	1570	3	7	5	17000


> New Y[]: 
	
	 2  0  0  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,46

## ITERATION 104 #######################


> Neighbours evaluated; 24
> Selected Move:	1570	4	4	3	17800


> New Y[]: 
	
	 2  0  0  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,465

## ITERATION 105 #######################


> Neighbours evaluated; 22
> Selected Move:	1570	4	3	5	16200


> New Y[]: 
	
	 2  0  0  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,47

## ITERATION 106 #######################


> Neighbours evaluated; 24
> Selected Move:	1570	4	5	8	17900


> New Y[]: 
	
	 2  0  0  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  1  0  0  0  0 
 > pw :0,475

## ITERATION 107 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	3	0	2	19400


> New Y[]: 
	
	 0  0  2  1  1  1  0  0  3  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,47

## ITERATION 108 #######################


> Neighbours evaluated; 22
> Selected Move:	1570	4	2	8	19300


> New Y[]: 
	
	 0  0  3  1  1  1  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,465

## ITERATION 109 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	2	5	19700


> New Y[]: 
	
	 0  0  1  1  1  3  0  0  2  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,46

## ITERATION 110 #######################


> Neighbours evaluated; 19
> Selected Move:	1570	4	8	2	17700


> New Y[]: 
	
	 0  0  2  1  1  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,455

## ITERATION 111 #######################


> Neighbours evaluated; 24
> Selected Move:	1570	4	2	4	18800


> New Y[]: 
	
	 0  0  1  1  2  3  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,45

## ITERATION 112 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	4	5	20000


> New Y[]: 
	
	 0  0  1  1  3  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,445

## ITERATION 113 #######################


> Neighbours evaluated; 16
> Selected Move:	1570	4	4	2	18800


> New Y[]: 
	
	 0  0  3  1  1  2  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,44

## ITERATION 114 #######################


> Neighbours evaluated; 19
> Selected Move:	1570	4	5	3	19800


> New Y[]: 
	
	 0  0  3  2  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,435

## ITERATION 115 #######################


> Neighbours evaluated; 16
> Selected Move:	1570	4	2	3	19300


> New Y[]: 
	
	 0  0  2  3  1  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,43

## ITERATION 116 #######################


> Neighbours evaluated; 17
> Selected Move:	1570	4	3	4	18500


> New Y[]: 
	
	 0  0  2  1  3  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,425

## ITERATION 117 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	2	4	18400


> New Y[]: 
	
	 0  0  3  1  2  1  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  1  1  0  0  0  0 
 > pw :0,42

## ITERATION 118 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	3	4	9	18500


> New Y[]: 
	
	 0  0  3  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,415

## ITERATION 119 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	2	5	18900


> New Y[]: 
	
	 0  0  1  1  0  3  0  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,41

## ITERATION 120 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	5	9	19300


> New Y[]: 
	
	 0  0  1  1  0  2  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,405

## ITERATION 121 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	5	2	17800


> New Y[]: 
	
	 0  0  2  1  0  1  0  0  1  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,4

## ITERATION 122 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	2	8	19800


> New Y[]: 
	
	 0  0  1  1  0  1  0  0  2  3 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,395

## ITERATION 123 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	3	9	1	18000


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 124 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	8	3	18500


> New Y[]: 
	
	 0  3  1  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,385

## ITERATION 125 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	3	5	17500


> New Y[]: 
	
	 0  3  1  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 126 #######################


> Neighbours evaluated; 21
> Selected Move:	1650	1	-1	7	21500


> New Y[]: 
	
	 0  3  1  1  0  2  0  1  1  0 


> New S[]: 
	
	 0  1  1  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 127 #######################


> Neighbours evaluated; 21
> Selected Move:	1683	3	2	6	20500


> New Y[]: 
	
	 0  3  0  1  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 128 #######################


> Neighbours evaluated; 25
> Selected Move:	1665	3	6	9	21500


> New Y[]: 
	
	 0  3  0  1  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 129 #######################


> Neighbours evaluated; 20
> Selected Move:	1619	3	5	4	21100


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 130 #######################


> Neighbours evaluated; 25
> Selected Move:	1510	2	9	-1	14600


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 131 #######################


> Neighbours evaluated; 26
> Selected Move:	1570	3	7	2	17100


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 132 #######################


> Neighbours evaluated; 22
> Selected Move:	1570	4	4	2	16000


> New Y[]: 
	
	 0  3  2  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 133 #######################


> Neighbours evaluated; 23
> Selected Move:	1623	1	-1	6	21500


> New Y[]: 
	
	 0  3  2  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 134 #######################


> Neighbours evaluated; 26
> Selected Move:	1640	3	8	7	21000


> New Y[]: 
	
	 0  3  2  1  1  0  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 135 #######################


> Neighbours evaluated; 25
> Selected Move:	1545	3	2	8	21000


> New Y[]: 
	
	 0  3  0  1  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 136 #######################


> Neighbours evaluated; 24
> Selected Move:	1620	3	6	2	22000


> New Y[]: 
	
	 0  3  1  1  1  0  0  1  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 137 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	2	7	-1	18000


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  2  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 138 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	4	8	3	18500


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 139 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	3	4	9	19500


> New Y[]: 
	
	 0  3  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 140 #######################


> Neighbours evaluated; 19
> Selected Move:	1570	4	3	2	17000


> New Y[]: 
	
	 0  3  2  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 141 #######################


> Neighbours evaluated; 24
> Selected Move:	1570	4	2	8	19000


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 142 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	3	2	5	18000


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,355

## ITERATION 143 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	8	3	18500


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,35

## ITERATION 144 #######################


> Neighbours evaluated; 21
> Selected Move:	1570	4	3	5	17500


> New Y[]: 
	
	 0  3  0  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,345

## ITERATION 145 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	5	9	16200


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  1 
 > pw :0,34

## ITERATION 146 #######################


> Neighbours evaluated; 22
> Selected Move:	1570	3	9	0	14500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 147 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	3	1	9	16300


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,33

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	9	3	18800


> New Y[]: 
	
	 2  0  0  3  0  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,325

## ITERATION 149 #######################


> Neighbours evaluated; 23
> Selected Move:	1570	4	3	5	17200


> New Y[]: 
	
	 2  0  0  1  0  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,32

## ITERATION 150 #######################


> Neighbours evaluated; 24
> Selected Move:	1836	1	-1	7	21200


> New Y[]: 
	
	 2  0  0  1  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 151 #######################


> Neighbours evaluated; 26
> Selected Move:	1702	3	9	2	21200


> New Y[]: 
	
	 2  0  1  1  0  3  0  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  1  0  0 
 > pw :0,31

## ITERATION 152 #######################


> Neighbours evaluated; 15
> Selected Move:	1677	3	5	9	21300


> New Y[]: 
	
	 2  0  1  1  0  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,305

## ITERATION 153 #######################


> Neighbours evaluated; 16
> Selected Move:	1579	3	8	5	22300


> New Y[]: 
	
	 2  0  1  1  0  1  0  1  0  3 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  1 
 > pw :0,3

## ITERATION 154 #######################


> Neighbours evaluated; 14
> Selected Move:	1660	3	2	4	21300


> New Y[]: 
	
	 2  0  0  1  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  1  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 155 #######################


> Neighbours evaluated; 27
> Selected Move:	1641	3	9	8	21900


> New Y[]: 
	
	 2  0  0  1  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 156 #######################


> Neighbours evaluated; 20
> Selected Move:	1662	4	8	3	21800


> New Y[]: 
	
	 2  0  0  3  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 157 #######################


> Neighbours evaluated; 25
> Selected Move:	1611	3	3	9	21300


> New Y[]: 
	
	 2  0  0  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  1  0  0 
 > pw :0,32

## ITERATION 158 #######################


> Neighbours evaluated; 27
> Selected Move:	1504	3	9	2	21800


> New Y[]: 
	
	 2  0  3  0  1  1  0  1  1  0 


> New S[]: 
	
	 0  0  0  0  1  1  0  1  0  0 
 > pw :0,325

## ITERATION 159 #######################


> Neighbours evaluated; 15
> Selected Move:	1510	2	5	-1	16300


> New Y[]: 
	
	 2  0  3  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 160 #######################


> Neighbours evaluated; 15
> Selected Move:	1510	4	2	4	17500


> New Y[]: 
	
	 2  0  1  0  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 161 #######################


> Neighbours evaluated; 14
> Selected Move:	1510	4	4	7	19000


> New Y[]: 
	
	 2  0  1  0  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 162 #######################


> Neighbours evaluated; 11
> Selected Move:	1510	4	7	8	18400


> New Y[]: 
	
	 2  0  1  0  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 163 #######################


> Neighbours evaluated; 13
> Selected Move:	1510	3	2	3	16400


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 164 #######################


> Neighbours evaluated; 24
> Selected Move:	1600	3	8	1	14000


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 165 #######################


> Neighbours evaluated; 28
> Selected Move:	1600	3	4	9	15000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 166 #######################


> Neighbours evaluated; 29
> Selected Move:	1770	1	-1	2	21500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 167 #######################


> Neighbours evaluated; 16
> Selected Move:	1578	3	3	8	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1 
 > pw :0,33

## ITERATION 168 #######################


> Neighbours evaluated; 21
> Selected Move:	1510	4	0	2	16500


> New Y[]: 
	
	 0  3  2  0  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 169 #######################


> Neighbours evaluated; 27
> Selected Move:	1570	1	-1	5	22000


> New Y[]: 
	
	 0  3  2  0  0  1  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 170 #######################


> Neighbours evaluated; 27
> Selected Move:	1680	3	7	3	22500


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,315

## ITERATION 171 #######################


> Neighbours evaluated; 16
> Selected Move:	1680	3	8	7	22000


> New Y[]: 
	
	 0  3  2  1  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 172 #######################


> Neighbours evaluated; 20
> Selected Move:	1606	4	2	9	22200


> New Y[]: 
	
	 0  3  1  1  0  1  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 173 #######################


> Neighbours evaluated; 22
> Selected Move:	1660	3	2	4	21200


> New Y[]: 
	
	 0  3  0  1  1  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 174 #######################


> Neighbours evaluated; 25
> Selected Move:	1624	3	3	8	21200


> New Y[]: 
	
	 0  3  0  0  1  1  0  1  1  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  1  0  0 
 > pw :0,335

## ITERATION 175 #######################


> Neighbours evaluated; 29
> Selected Move:	1718	3	9	3	21500


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 176 #######################


> Neighbours evaluated; 21
> Selected Move:	1510	2	5	-1	16000


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 177 #######################


> Neighbours evaluated; 26
> Selected Move:	1510	4	3	7	16700


> New Y[]: 
	
	 0  3  0  1  1  0  0  2  1  0 


> New S[]: 
	
	 0  1  0  1  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 178 #######################


> Neighbours evaluated; 27
> Selected Move:	1570	3	7	0	14500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 179 #######################


> Neighbours evaluated; 25
> Selected Move:	1665	1	-1	9	21000


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 180 #######################


> Neighbours evaluated; 29
> Selected Move:	1570	2	4	-1	15500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 181 #######################


> Neighbours evaluated; 24
> Selected Move:	1510	3	0	7	17700


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 182 #######################


> Neighbours evaluated; 23
> Selected Move:	1510	4	7	3	17000


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 183 #######################


> Neighbours evaluated; 23
> Selected Move:	1510	4	3	8	16500


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,36

## ITERATION 184 #######################


> Neighbours evaluated; 25
> Selected Move:	1510	4	8	9	14700


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 185 #######################


> Neighbours evaluated; 20
> Selected Move:	1510	3	1	2	17000


> New Y[]: 
	
	 0  0  3  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 186 #######################


> Neighbours evaluated; 24
> Selected Move:	1510	4	2	3	19000


> New Y[]: 
	
	 0  0  1  3  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 187 #######################


> Neighbours evaluated; 22
> Selected Move:	1510	4	3	7	19700


> New Y[]: 
	
	 0  0  1  1  0  0  0  3  1  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 188 #######################


> Neighbours evaluated; 17
> Selected Move:	1510	4	7	8	19100


> New Y[]: 
	
	 0  0  1  1  0  0  0  1  3  2 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 189 #######################


> Neighbours evaluated; 18
> Selected Move:	1510	4	8	9	18300


> New Y[]: 
	
	 0  0  1  1  0  0  0  1  2  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 190 #######################


> Neighbours evaluated; 21
> Selected Move:	1510	4	8	2	16300


> New Y[]: 
	
	 0  0  2  1  0  0  0  1  1  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 191 #######################


> Neighbours evaluated; 24
> Selected Move:	1635	1	-1	5	21800


> New Y[]: 
	
	 0  0  2  1  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 192 #######################


> Neighbours evaluated; 26
> Selected Move:	1480	2	3	-1	17300


> New Y[]: 
	
	 0  0  2  0  0  1  0  1  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  1 
 > pw :0,315

## ITERATION 193 #######################


> Neighbours evaluated; 26
> Selected Move:	1480	4	2	5	18800


> New Y[]: 
	
	 0  0  1  0  0  2  0  1  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  1  1 
 > pw :0,31

## ITERATION 194 #######################


> Neighbours evaluated; 26
> Selected Move:	1510	3	5	0	16800


> New Y[]: 
	
	 2  0  1  0  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 195 #######################


> Neighbours evaluated; 15
> Selected Move:	1510	4	9	2	17300


> New Y[]: 
	
	 2  0  3  0  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 196 #######################


> Neighbours evaluated; 16
> Selected Move:	1540	1	-1	3	21800


> New Y[]: 
	
	 2  0  3  1  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  1 
 > pw :0,295

## ITERATION 197 #######################


> Neighbours evaluated; 13
> Selected Move:	1510	4	0	3	19300


> New Y[]: 
	
	 0  0  3  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 198 #######################


> Neighbours evaluated; 21
> Selected Move:	1510	4	2	3	18800


> New Y[]: 
	
	 0  0  2  3  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 199 #######################


> Neighbours evaluated; 21
> Selected Move:	1510	4	3	7	19500


> New Y[]: 
	
	 0  0  2  1  0  0  0  3  1  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 200 #######################


> Neighbours evaluated; 20
> Selected Move:	1570	3	7	5	18700


> New Y[]: 
	
	 0  0  2  1  0  3  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,275

## ITERATION 201 #######################


> Neighbours evaluated; 22
> Selected Move:	1570	4	2	5	19800


> New Y[]: 
	
	 0  0  3  1  0  2  0  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  1 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 22
> Selected Move:	1510	3	5	0	17800


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,265

## ITERATION 203 #######################


> Neighbours evaluated; 11
> Selected Move:	1510	4	2	3	19800


> New Y[]: 
	
	 2  0  1  3  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,26

## ITERATION 204 #######################


> Neighbours evaluated; 9
> Selected Move:	1510	4	3	8	19900


> New Y[]: 
	
	 2  0  1  1  0  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  1 
 > pw :0,255

## ITERATION 205 #######################


> Neighbours evaluated; 10
> Selected Move:	1570	3	2	5	18900


> New Y[]: 
	
	 2  0  0  1  0  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  1 
 > pw :0,25
________________________________________________________________

Best solution found: 2430
Run Termination time: 31.01.2010 10:32:23
Run duration: 00:00:53.8125000
________________________________________________________________
